Comparative study of TCP friendly Window based Congestion Control Algorithms
نویسنده
چکیده
This work presents a thorough study of TCP like window based congestion control. These schemes are basically different from memory less AIMD and binomial schemes. As like this, a small step allows a much broader exploration of friendliness for TCP congestion controls than memory less AIMD and binomial schemes. We propose An Array of window based congestion controls possessing higher smoothness in steady states, while it reacts on promptly to sudden changes in network conditions. We analyze the smoothness, transient behavior and performance comparisons for new Array of control. In SIMD (Square Increase Multiplicative Decrease), congestion window size increases superlinearly in proportion to the square of time elapsed since the detection of last loss event. In other words, increase is inversely proportional to window size at the time of last loss detection. Thus, SIMD has higher aggressiveness and fast convergence to fairness.
منابع مشابه
Analysis on Adjustment-Based TCP-Friendly Congestion Control: Fairness and Stability
In this paper, we focus on understanding the binomial congestion control algorithms, which is proposed in [11] and can generalize TCP-style additive-increase by increasing inversely proportional to a power k of the current window (for TCP, k=0) and generalize TCP-style multiplicative-decrease by decreasing proportional to a power l of the current window (for TCP, l=1). We discuss their global f...
متن کاملTCP-Friendly SIMD Congestion Control and Its Convergence Behavior
The increased diversity of Internet application requirements has spurred recent interests in exible congestion control mechanisms. Window-based congestion control schemes use increase rules to probe available bandwidth, and decrease rules to back o when congestion is detected. The parameterization of these control rules is done so as to ensure that the resulting protocol is TCP-friendly in term...
متن کاملDesigning TCP-Friendly Window-based Congestion Control for Real-time Multimedia Applications
Real-time multimedia applications prefer smooth and predictable throughput to TCP-like abrupt sending rate changes, and this led to the development of TCP-Friendly Rate-based Congestion Control (TFRC). However, we observed a longterm throughput imbalance between TFRC and TCP sources, especially under a low level of statistical multiplexing. We set out to reduce these differences by re-introduci...
متن کاملTCP-friendly Congestion Control for Real-time Streaming Applications
This paper introduces and analyzes a class of nonlinear congestion control algorithms called binomial algorithms, motivated in part by the needs of streaming audio and video applications for which a drastic reduction in transmission rate upon congestion is problematic. Binomial algorithms generalize TCP-style additive-increase by increasing inversely proportional to a power k of the current win...
متن کامل